NEW ALGORITHM , S FOR POLYNOMIAL AND TRIGONOMETRIC INTERPOLATION ON PARALLEL COMPUTERS by Ilan Bar -
نویسندگان
چکیده
An interpolation polynomial of order N is constructed from p indepen dent subpolynomials of order n '" Nip. Each such subpolynomial is found independently and in parallel. Moreover, evaluation of the polynomial at any given point is done independently and in parallel, except for a final step of summation of p elements. Hence, the algorithm has almost no commu ,:.. nication overhead and can be implemented easily on any parallel computer. We give examples of finite-difference interpolation, trigonometric interpola 'tion, and Chebyshev interpolation, and conclude with the general Hermite interpolation problem. -
منابع مشابه
INTERPOLATION BY HYPERBOLIC B-SPLINE FUNCTIONS
In this paper we present a new kind of B-splines, called hyperbolic B-splines generated over the space spanned by hyperbolic functions and we use it to interpolate an arbitrary function on a set of points. Numerical tests for illustrating hyperbolic B-spline are presented.
متن کاملTENSION QUARTIC TRIGONOMETRIC BÉZIER CURVES PRESERVING INTERPOLATION CURVES SHAPE
In this paper simple quartic trigonometric polynomial blending functions, with a tensionparameter, are presented. These type of functions are useful for constructing trigonometricB´ezier curves and surfaces, they can be applied to construct continuous shape preservinginterpolation spline curves with shape parameters. To better visualize objects and graphics atension parameter is included. In th...
متن کاملStability Results for Scattered Data Interpolation by Trigonometric Polynomials
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus Td by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the fast Fourier transforms for nonequispaced nodes. The main result is that under mild assumptions the total complexity for solving the interpolation problem...
متن کاملNon-equidistant approximate DFT based on Z-splines
In this paper, we consider an algorithm that efficiently evaluates a trigonometric polynomial at arbitrarily spaced nodes. It is based on the approximation of the polynomial by a function we can evaluate easily. We are particularly interested in the case where we interpolate the trigonometric polynomial using high-order cardinal interpolation kernels known as Z-splines, which we construct and s...
متن کاملMinimization of Errors of the Polynomial- Trigonometric Interpolation with Shifted Nodes∗
The polynomial-trigonometric interpolation based on the Krylov approach for a smooth function given on [-1, 1] is defined on the union of m shifted each other uniform grids with the equal number of points. The asymptotic errors of the interpolation in both uniform and L2 metrics are investigated. It turned out that the corresponding errors can be minimized due to an optimal choice of the shift ...
متن کامل